// 最小的K个数

#include <vector>
#include <algorithm>
using namespace std;

class Solution 
{
public:
    vector<int> GetLeastNumbers_Solution(vector<int>& input, int k) 
    {
        // write code here
        vector<int> ret;
        if(input.size() < k || 0 == k) return ret;
        sort(input.begin(), input.end());
        return vector<int>({input.begin(), input.begin() + k});
    }
};